RTCSA 2006 Work in Progress Section

نویسندگان

  • Stefan M. Petters
  • Chih-Chiang Lee
  • Jun Wu
  • Chih-Wen Hsueh
  • Chi-Sheng Shih
  • Hiroo Ishikawa
  • Harry Sun
  • Tatsuo Nakajima
  • Gernot Heiser
  • Yuki Kinebuchi
  • Shuichi Oikawa
چکیده

User mode program usually requires the assistance from hardware in order to execute a mode change before using system service. This also allows user mode program to gain complete control of hardware. In this paper, new instructions are proposed; the OS may then take advantage of these instructions to more effectively use the system service, while reducing the kernel size and adding to the flexibility in design. Introduction System call acts as a communication interface between the Operation System (OS) and User Mode Program (UMP). To guarantee that all hardware resources are under the control of OS, the processor must have 2 or more execution modes (i.e. kernel mode and user mode). In addition, mode changes (e.g. user mode => kernel mode) must be executed such that system security is not harmed in any way. Currently, most OS’s and CPUs use software interrupts to complete mode changes. Since all system calls have the same entry point, kernels must use certain types of dispatch mechanisms (e.g. table lookup) to allow the mapping between system calls and Kernel Service Routines (KSR). Such mechanisms make the pre-processing mechanisms of system calls fairly complex. Thus, in this paper we propose a new method called Fast System Call (FSC) to increase the efficiency of system calls. Take as an example Linux’s system calls operating on a Pentium processor. Figure 1 shows that 5 steps are required to complete a system call: 1. UMP generates a software interrupt (i.e. int 0x80); 2. processor loads the content at location 0x80 in the Interrupt Descript Table (IDT) into the Program Counter (PC); 3. when the new PC is loaded, the OS will call out to different KSRs based on different value of AX registers; 4. returning from the called KSR; 5. returning from kernel.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-time scalability of nested spin locks

When a real-time system is realized on a sharedmemory multiprocessor, the worst-case performance of interprocessor synchronizations is one of the most important issues. In this paper, scalability of the maximum execution times of critical sections guarded by nested spin locks is discussed. With the simplest method, the maximum execution times become O(n m ), where n is the number of contending ...

متن کامل

Sensitivity Analysis on the Assumption of Geometric Batch Arrivals for Real-Time Versus Non-Real-Time Scheduling in a Statistical Multiplexer

Sensitivity analysis is done on the assumption of geometric batch arrivals used by several authors in the study of tradeoffs between real-time and non-real-time trafJic in a statistical multiplexer. This work finds the geometric batch arrival assumption conservative compared with correlated MMPP’s. The Poisson arrival assumption is much more optimistic that the geometric batch arrival assumption.

متن کامل

Scheduling Fixed-Priority Tasks with Preemption Threshold

While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...

متن کامل

A Synthetic Demographic Model of the UK Population: Methods, Progress and Problems

The simulation model has four distinct elements: a baseline demographic model; a dynamic forecasting model; a simulator for social and economic activities; and a set of scenario-based policy modules. This paper describes progress to date in implementing the baseline demographic model. In Section 2 of the paper we will discuss and evaluate the techniques which we have used to generate population...

متن کامل

Performance evaluation of a firm real-time database system

In conventional database systems, performance is primarily measured by the number of transactions completed within a unit time. In real-time applications, timing and criticality characteristics of transactions must be taken into account. In this paper, we examine the performance of StarBase, a firm real-time database system. The deadline guarantee ratio and average response times are the primar...

متن کامل

Holistic schedulability analysis of a fault-tolerant real-time distributed run-time support

The feasibility test of a hard real-time system must not only take into account the temporal behavior of the application tasks but also the behavior of the run-time support in charge of executing applications. This paper is devoted to the schedulability analysis of a run-time support for distributed dependable hard real-time applications. In contrast to previous works that consider rather simpl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006